A Tableau Calculus for Temporal Description Logic : TheConstant Domain Case
نویسندگان
چکیده
We show how to combine the standard tableau system for the basic description logic ALC with Wolper's tableau calculus for propositional temporal logic PTL in order to design a terminating sound and complete tableau-based satissability-checking algorithm for the temporal description logic PTL ALC of 19] interpreted in models with constant domains. We use the method of quasimodels 16, 14] to represent models with innnite domains, and the technique of minimal types 9] to maintain these domains constant. The combination is exible and can be extended to more expressive description logics or even to decidable fragments of rst-order temporal logics.
منابع مشابه
A Tableau Calculus for Temporal Description Logic: the Expanding Domain Case
In this paper we present a tableau calculus for a temporal extension of the description logic ALC, called T L ALC. This logic is based on the temporal language with`Until' interpreted over the natural numbers with expanding ALC-domains. The tableau calculus forms an elaborated combination of Wolper's tableau calculus for propositional linear temporal logic, the standard tableau-algorithm for AL...
متن کاملA Tableau Calculus for a Temporal Logic with Temporal Connectives
The paper presents a tableau calculus for a linear time tem poral logic for reasoning about processes and events in concurrent sys tems The logic is based on temporal connectives in the style of Transac tion Logic BK and explicit quanti cation over states The language extends rst order logic with sequential and parallel conjunction parallel disjunction and temporal implication Explicit quanti c...
متن کاملA Compatible Approach to Temporal Description Logics
Temporal description logics (TDLs) have been studied by many researchers (see e.g., [1, 10] for surveys and [4, 2, 15] for recent or important results). These TDLs are, however, not compatible in the following sense: these are not embeddable into the standard (non-temporal) description logics (DLs), and hence the existing algorithms for testing satisfiability in the standard DLs are not availab...
متن کاملIndividual Reuse in Description Logic Reasoning
Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. To address this, we propose a tableau calculus with individual reuse: to satisfy an existential assertion, our calculus nondeterministically tries to reus...
متن کامل